A Weak Calculus with Explicit Operators for Pattern Matching and Substitution
نویسنده
چکیده
In this paper we propose a Weak Lambda Calculus called λPw having explicit operators for Pattern Matching and Substitution. This formalism is able to specify functions defined by cases via pattern matching constructors as done by most modern functional programming languages such as OCAML. We show the main property enjoyed by λPw, namely subject reduction, confluence and strong normalization.
منابع مشابه
Extending a -calculus with Explicit Substitution Which Preserves Strong Normalisation into a Connuent Calculus on Open Terms
The last fteen years have seen an explosion in work on explicit substitution, most of which is done in the style of the-calculus. In (Kamareddine & R os, 1995a), we extended the-calculus with explicit substitutions by turning de Bruijn's meta-operators into object-operators ooering a style of explicit substitution that diiers from that of. The resulting calculus, s, remains as close as possible...
متن کاملThe Connuence of the S E -calculus via a Generalized Interpretation Method
The last fteen years have seen an explosion in work on explicit substitution, most of which is done in the style of the-calculus. In KR95a], we extended the-calculus with explicit substitutions by turning de Bruijn's meta-operators into object-operators ooering a style of explicit substitution that diiers from that of. The resulting calculus , s, remains as close as possible to the-calculus fro...
متن کاملExplicit substitutions for control operators ?
The-calculus is a-calculus with a local operator closely related to normal-isation procedures in classical logic and control operators in functional programming. We introduce exp, an explicit substitution calculus for , show it preserves strong normali-sation and that its simply typed version is strongly normalising. Interestingly, exp is the rst example for which the decency method of showing ...
متن کاملA fully-abstract semantics of lambda-mu in the pi-calculus
We study the λμ-calculus, extended with explicit substitution, and define a compositional outputbased interpretation into a variant of the π-calculus with pairing that preserves single-step explicit head reduction with respect to weak bisimilarity. We define four notions of weak equivalence for λμ – one based on weak reduction ∼wβμ, two modelling weak head-reduction and weak explicit head reduc...
متن کاملExplicit Substitutions for Contextual Type Theory
In this paper, we present an explicit substitution calculus which distinguishes between ordinary bound variables and meta-variables. Its typing discipline is derived from contextual modal type theory. We first present a dependently typed lambda calculus with explicit substitutions for ordinary variables and explicit meta-substitutions for meta-variables. We then present a weak head normalizatio...
متن کامل